package org.lql.algo.codecrush.week009.question.type.III;

import org.lql.algo.common.TreeNode;

/**
 * @author: liangqinglong
 * @date: 2025-08-20 16:59
 * @description: 617. 合并二叉树 <a href="https://leetcode.cn/problems/merge-two-binary-trees/description/">...</a>
 **/
public class MergeTrees {

	public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
		if (root1 == null) {
			return root2;
		}
		if (root2 == null) {
			return root1;
		}
		TreeNode merged = new TreeNode(root1.val + root2.val);
		merged.left = mergeTrees(root1.left, root2.left);
		merged.right = mergeTrees(root1.right, root2.right);
		return merged;
	}
}
